The Partial Visibility Representation Extension Problem
نویسندگان
چکیده
منابع مشابه
On the Extension Problem for Partial Permutations
A family of pseudovarieties of solvable groups is constructed, each of which has decidable membership and undecidable extension problem for partial permutations. Included are a pseudovariety U satisfying no non-trivial group identity and a metabelian pseudovariety Q. For each of these pseudovarieties V, the inverse monoid pseudovariety Sl∗V has undecidable membership problem. As a consequence, ...
متن کاملThe Problem of Partial Geodesic Representation
The original problem of geodesic representation, solved by Dini (1869) with reality restrictions and by Lie (1883) in complete generality, may be stated as follows : Find all pairs of surfaces S and Sx whose points may be put into correspondence in such a way that every geodesic on the one surface is pictured by a geodesic on the other. Apart from the trivial case where Sx is isometric with (ap...
متن کاملShape From Silhouette: Towards a Solution for Partial Visibility Problem
Acquiring human shape is a prerequisite to many applications in augmented and virtual reality, as well as in computer graphics and animation. The acquisition of a real person must be precise enough to have the best possible (realistic) rendering. To do so in real time, "Shape-from-silhouette" (SFS) methods are used. One limitation of these methods is that the acquired subject must be visible fr...
متن کاملLinear-time Algorithm for Partial Representation Extension of Interval Graphs
Interval graphs are intersection graphs of closed intervals of the real-line. The wellknown computational problem, called recognition, asks for an input graph G whether it can be represented by closed intervals, i.e., whether G is an interval graph. There are several linear-time algorithms known for recognizing interval graphs. In this paper, we study a generalization of recognition, called par...
متن کاملAn Efficient Local Search for Partial Latin Square Extension Problem
A partial Latin square (PLS) is a partial assignment of n symbols to an n×n grid such that, in each row and in each column, each symbol appears at most once. The partial Latin square extension problem is an NP-hard problem that asks for a largest extension of a given PLS. In this paper we propose an efficient local search for this problem. We focus on the local search such that the neighborhood...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2017
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-017-0322-4